Constructing minimal telescopers for rational functions in three discrete variables

We present a new algorithm for constructing minimal telescopers rational functions in three discrete variables. This is the first reduction-based that goes beyond bivariate case. The termination of guaranteed by known existence criterion telescopers. Our approach has important feature it avoids potentially costly computation certificates. Computational experiments are also provided so as to illustrate efficiency our approach.